On perfect double dominating sets in grids cylinders and tori
نویسندگان
چکیده
منابع مشابه
Computing #2-SAT of Grids, Grid-Cylinders and Grid-Tori Boolean Formulas
We present an adaptation of transfer matrix method for signed grids, grid-cylinders and grid-tori. We use this adaptation to count the number of satisfying assignments of Boolean Formulas in 2-CNF whose corresponding associated graph has such grid topologies.
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملDouble Roman domination and domatic numbers of graphs
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...
متن کاملPerfect Domination of Rectangular Grids
Let m and n be positive integers. The algorithmic search for perfect dominating sets of the rectangular grid Gm;n satisfying an initial condition S 0 de ned as an admissible subset of a side Gm;1 of Gm;n such that S \ Gm;1 = S 0 is considered. A binary decision algorithm that generates all such perfect dominating sets is presented, and some related questions and conjectures are posed, leading t...
متن کاملOn the spectrum of the forced matching number of graphs
Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M , such that S is contained in no other perfect matching of G. This notion originally arose in chemistry in the study of molecular resonance structures. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 37 شماره
صفحات -
تاریخ انتشار 2007